Advanced Data Structures 2 Introduction 2.1 Dynamic Trees Problem 3 Sleator and Tarjan's St Trees [1] [2]
نویسنده
چکیده
The problem of maintaining a forest where edge insertions and deletions are allowed is called the dynamic trees problem. Efficient solution to this problem have numerous applications, particularly in dynamic graphs. Several data structures which supports dynamic trees problem in logarithmic time have been proposed. In these lecture we will see two such data structures, the first is ST-tress proposed by Sleator and Tarjan in [1] [2] and the second one is top trees, proposed by Alstrup et al. in [4]. This lecture will be based on Renato F. Werneck’s PhD dissertation [3].
منابع مشابه
Implementations of Dynamic Tree Collections Based on Splay Trees
We describe implementations of two closely related variants of dynamic rooted trees. These variants are similar to Sleator and Tarjan's dynamic trees, but instead of the operation of nding the minimum key on the path from a given node to the root, we have the operation of nding the minimum key in the subtree of a given node (the rst variant) and the operation of nding a xed key value in the sub...
متن کاملDesign and Analysis of Data Structures for Dynamic Trees
The dynamic trees problem is that of maintaining a forest that changes over time through edge insertions and deletions. We can associate data with vertices or edges and manipulate this data, individually or in bulk, with operations that deal with whole paths or trees. Efficient solutions to this problem have numerous applications, particularly in algorithms for network flows and dynamic graphs ...
متن کاملOptimal Self-adjusting Trees for Dynamic String Data in Secondary Storage
We present a self-adjusting layout scheme for suffix trees in secondary storage that provides optimal number of disk accesses for a sequence of string or substring queries. This has been an open problem since Sleator and Tarjan presented their splaying technique to create self-adjusting binary search trees in 1985. In addition to resolving this open problem, our scheme provides two additional a...
متن کاملar X iv : c s / 03 10 06 5 v 1 [ cs . D S ] 3 1 O ct 2 00 3 Maintaining Information in Fully - Dynamic Trees with Top Trees ∗
We introduce top trees as a new data structure that makes it simpler to maintain many kinds of information in a fully-dynamic forest. As prime examples, we show how to maintain the diameter, center, and median of each tree in the forest. The forest can be updated by insertion and deletion of edges and by changes to vertex and edge weights. Each update is supported in O(log n) time, where n is t...
متن کاملDynamizing Static Algorithms, with Applications to Dynamic Trees and History Independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamized automatically by keeping track of dependences between code and data in the form of a dynamic dependence graph. To study the performance of such automatically dynamized algorithms we present an analysis technique base...
متن کامل